minimum cost spanning tree
英 [ˈmɪnɪməm kɒst ˈspænɪŋ triː]
美 [ˈmɪnɪməm kɔːst ˈspænɪŋ triː]
网络 最小生成树; 最小代价生成树; 最小代价生成树问题; 最小成本扩张树
双语例句
- KK-means Clustering Method Improved Based-on Minimum Cost Spanning Tree and Its Applications in Seismic Data
基于最小生成树思想改进后的KK-MEANS聚类方法研究及其在地震数据集中的应用 - Based on spanning tree algorithm that is suitable to data fusion, the principle and features of Minimum Cost Spanning Tree ( MCST) is analyzed.
在适合数据融合的生成树算法的基础上，分析能够有效延长网络生命的最小代价生成树路由协议的原理和特点。 - Concept and implement of graph, basic operations of graph, minimum cost spanning tree, shortest path problem, AOV and AOE network.
图的概念和实现；图的基本操作；最小价值生成树；最短路径；活动网络。 - First established the minimum transmission cost model in online multicast data transmission network, given the concept of efficient presenting set of spanning tree, and presented an algorithm to generate one efficient presenting set with time complexity O ( mlogen).
首先建立了数据传输网络选择的最小成本模型，给出了有效支撑树代表集的概念，并给出了一个时间复杂性为O（mlogen）的算法产生代表集。 - In this paper, a parallel algorithm for computing MCST ( Minimum Cost Spanning Tree) on a fixed-size linear array of processors is presented.
本文给出一种在P个处理机线性阵列上求MCST（最小代价生成树）的并行算法，记为OLA-MCST。 - A Minimum Cost Spanning Tree Constructing Algorithm
最小生成树算法的快速实现 - A routing protocol for wireless sensor networks was proposed. The protocol used a data aggregation scheme of minimum transmission cost spanning tree.
提出了一种针对无线传感器网络的路由协议，该路由采用最小传输成本生成树的数据汇聚机制。 - An ALgorithm of the Minimum Cost/ Capacity Ratio Spanning Tree
最小费用/容量比生成树的一个算法 - A new algorithm of minimum cost spanning tree
最小生成树的算法 - Minimum cost k-degree constrained spanning tree game
最小费用k度限制树对策 - The minimum cost k-degree constrained spanning tree game.
最小费用k度限制支撑树对策问题。 - A Computer Management System for Textile Products Cost Calculation A NEW ALGORITHM OF MINIMUM COST SPANNING TREE
纺织产品成本计算的计算机管理系统最小生成树的算法 - Based on the characteristics of the wireless sensor networks, a data aggregation scheme of minimum transmission cost spanning tree is designed.
针对传感器网络的特点，提出了一种最小传输成本生成树的数据汇聚机制。 - The last three questions of cooperative games arise from the minimum cost spanning tree game of payment game.
其中问题2、3、4是由最小费用支撑树对策延伸出来的支付对策问题。 - The branch and bound algorithm of degree-constrained minimum cost spanning tree
带有度约束的最小耗费生成树的分支限界算法 - This paper discusses the application of adjacency matrix at the algorithm's analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。 - The player number decreasing minimum cost spanning tree game.
局中人数目变化的最小费用支撑树对策问题。